Error Bounds for Minimal EnergyBivariate Polynomial
نویسندگان
چکیده
We derive error bounds for bivariate spline interpolants which are calculated by minimizing certain natural energy norms. x1. Introduction Suppose we are given values ff(v)g v2V of an unknown function f at a set V of scattered points in IR 2. To approximate f, we choose a linear space S of polynomial splines of degree d deened on a triangulation 4 with vertices at the points of V. be the set of all splines in S that interpolate f at the points of V. We assume that S is big enough so that U f is nonempty. Then a commonly used way to create an approximation of f (cf. 6{10]) is to choose a spline S f such that E(S f) = min s2U f E(s); (1:2) where E(s) := X T24 Z T s 2 xx + 2s 2 xy + s 2 yy : (1:3) We refer to S f as the minimal energy interpolating spline.
منابع مشابه
Extrapolation vs. projection methods for linear systems of equations
It is shown that the four vector extrapolation methods, minimal polynomial extrapolation, reduced rank extrapolation, modified minimal polynomial extrapolation, and topological epsilon algorithm, when applied to linearly generated vector sequences, are Krylov subspace methods, and are equivalent to some well known conjugate gradient type methods. A unified recursive method that includes the con...
متن کاملTWO LOW-ORDER METHODS FOR THE NUMERICAL EVALUATION OF CAUCHY PRINCIPAL VSlLUE INTEGRALS OF OSCILLATORY KIND
In this paper, we develop two piecewise polynomial methods for the numerical evaluation of Cauchy Principal Value integrals of oscillatory kind. The two piecewisepolynomial quadratures are compact, easy to implement, and are numerically stable. Two numerical examples are presented to illustrate the two rules developed, The convergence of the two schemes is proved and some error bounds obtai...
متن کاملQuantum lower bounds by entropy numbers
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on quantum approximation of embeddings between finite dimensional Lp spaces and of Sobolev embeddings.
متن کاملI t 1 EXTRAPOLATION vs PROJECTION METHODS FOR LINEAR SYSTEJ
It is ,shown that the four, vectof extrapolation methods. minimal polynomial extrapolation. reduced rank extrapolation. modified minimal polynomial extrapolation. and topological epsilon algorithm. when appiied to linearly generated vector sequences. are Krylov subspace methods. and· a~ equivalent to some well known conjugate gradient type methods., A unified recursive method thaJ includes the ...
متن کامل